Point Selections and Weak ε-Nets for Convex Hulls
نویسندگان
چکیده
One of our results: let X be a finite set on the plane, 0 < g < 1, then there exists a set F (a weak g-net) of size at most 7/e 2 such that every convex set containing at least e\X\ elements of X intersects F. Note that the size of F is independent of the size of X.
منابع مشابه
Point Selections and Weak e-Nets for Convex Hulls
One of our results: Let X be a finite set on the plane, 0 < ε < 1. Then there exists a set F (a weak ε-net) of size at most 7/ε such that every convex set containing at least ε|X| elements of X intersects F . Note that the size of F is independent of the size of X. 1Research supported by a United Stat es Isreal BSF grant 2On leave from the Mathematica l Institute of the Hungarian Academy of Sci...
متن کاملHow to Net a Convex Shape
We revisit the problem of building weak ε-nets for convex ranges over a point set in R. Unfortunately, the known constructions of weak ε-nets yields sets that are of size Ω(ε−decd 2 ), where c is some constant. We offer two alternative schemes that yield significantly smaller sets, and two related results, as follows: (A) Let S be a sample of size Õ(dε) points from the original point set (which...
متن کاملSmall Weak Epsilon-Nets in Three Dimensions
We study the problem of finding small weak ε-nets in three dimensions and provide new upper and lower bounds on the value of ε for which a weak ε-net of a given small constant size exists. The range spaces under consideration are the set of all convex sets and the set of all halfspaces in R3.
متن کاملSmall weak epsilon nets
Given a set P of points in the plane, a set of points Q is a weak ε-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing ε|P | points contains a point of Q. In this paper, we determine bounds on εi , the Preprint submitted to Elsevier Science 10 February 2008 smallest epsilon that can be guaranteed for any P when |Q| = i, for small values...
متن کاملA Note about Weak ε-nets for Axis-Parallel Boxes in d-space
We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axisparallel boxes in R, for d ≥ 4. Our analysis uses a non-trivial variant of the recent technique of Aronov et al. [2] that yields (strong) ε-nets, whose size have the above asymptotic bound, for d = 2, 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007